Discrete range clustering using Monte Carlo methods

Discrete range clustering using Monte Carlo methods

Quick Release-This Technical Memoi'andum is an unedited report. It is being released in this format to quickly provide the research community with important information.

Evolutionary Monte Carlo Methods for Clustering

The problem of clustering a group of observations according to some objective function (e.g., K -means clustering, variable selection) or a density (e.g., posterior from a Dirichlet process mixture model prior) can be cast in the framework of Monte Carlo sampling for cluster indicators. We propose a new method called the evolutionary Monte Carlo clustering (EMCC) algorithm, in which three new “...

Clustering Using Monte Carlo Cross-Validation

Finding the “right” number of clusters, Ic, for a data set is a difficult, and often ill-posed, problem. In a probabilistic clustering context, likelihood-ratios, penalized likelihoods, and Bayesian techniques are among the more popular techniques. In this paper a new cross-validated likelihood criterion is investigated for determining cluster structure. A practical clustering algorithm based o...

Monte Carlo and quasi-Monte Carlo methods

Monte Carlo is one of the most versatile and widely used numerical methods. Its convergence rate, O(N~^), is independent of dimension, which shows Monte Carlo to be very robust but also slow. This article presents an introduction to Monte Carlo methods for integration problems, including convergence theory, sampling methods and variance reduction techniques. Accelerated convergence for Monte Ca...

Sequential Monte Carlo Methods for Nonlinear Discrete-Time Filtering